Weighted Inner Products for GMRES and GMRES-DR
نویسندگان
چکیده
The convergence of the restarted GMRES method can be significantly improved, for some problems, by using a weighted inner product that changes at each restart. How does this weighting affect convergence, and when is it useful? We show that weighted inner products can help in two distinct ways: when the coefficient matrix has localized eigenvectors, weighting can allow restarted GMRES to focus on eigenvalues that otherwise cause slow convergence; for general problems, weighting can break the cyclic convergence pattern into which restarted GMRES often settles. The eigenvectors of matrices derived from differential equations are often not localized, thus limiting the impact of weighting. For such problems, incorporating the discrete cosine transform into the inner product can significantly improve GMRES convergence, giving a method we call WGMRES-DCT. Integrating weighting with eigenvalue deflation via GMRES-DR can also give effective solutions.
منابع مشابه
A weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations
The solution of large scale Sylvester matrix equation plays an important role in control and large scientific computations. A popular approach is to use the global GMRES algorithm. In this work, we first consider the global GMRES algorithm with weighting strategy, and propose some new schemes based on residual to update the weighting matrix. Due to the growth of memory requirements and computat...
متن کاملWeighted Versions of Gl-fom and Gl-gmres for Solving General Coupled Linear Matrix Equations
More recently, Beik and Salkuyeh [F. P. A. Beik and D. K. Salkuyeh, On the global Krylov subspace methods for solving general coupled matrix equations, Computers and Mathematics with Applications, 62 (2011) 4605–4613] have presented the Gl-FOM and Gl-GMRES algorithms for solving the general coupled linear matrix equations. In this paper, two new algorithms called weighted Gl-FOM (WGl-FOM) and w...
متن کاملTheoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کاملA Weighted RRGMRES Implementation
GMRES is a popular iterative method for the solution of linear system of equations with an unsymmetric square matrix. Range restricted GMRES (RRGMRES) is one GMRES version proposed by Calvetti et al in 2000. In this paper, a weighted implementation for RRGMRES is proposed. Numerical results prove this weighted RRGMRES is better than RRGMRES.
متن کاملNested Krylov Methods and Preserving the Orthogonality
SUMMARY Recently the GMRESR inner-outer iteration scheme for the solution of linear systems of equations has been proposed by Van der Vorst and Vuik. Similar methods have been proposed by Axelsson and Vassilevski 1] and Saad (FGMRES) 10]. The outer iteration is GCR, which minimizes the residual over a given set of direction vectors. The inner iteration is GMRES, which at each step computes a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2017